Irreducible Complexity Revisited

نویسنده

  • William A. Dembski
چکیده

Michael Behe’s concept of irreducible complexity, and in particular his use of this concept to critique Darwinism, continues to come under heavy fire from the biological community. The problem with Behe, so Darwinists inform us, is that he has created a problem where there is no problem. Far from constituting an obstacle to the Darwinian mechanism of random variation and natural selection, irreducible complexity is thus supposed to be eminently explainable by this same mechanism. But is it really? It’s been eight years since Behe introduced irreducible complexity in Darwin’s Black Box (a book that continues to sell 15,000 copies per year in English alone). I want in this essay to revisit Behe’s concept of irreducible complexity and indicate why the problem he has raised is, if anything, still more vexing for Darwinism than when he first raised it. The first four sections of this essay review and extend material that I’ve treated elsewhere. The last section contains some novel material. 1 The Definition of Irreducible Complexity Highly intricate molecular machines play an integral part in the life of the cell and are increasingly attracting the attention of the biological community. For instance, in February 1998 the premier biology journal Cell devoted a special issue to “macromolecular machines.” All cells use complex molecular machines to process information, convert energy, metabolize nutrients, build proteins, and transport materials across membranes. Bruce Alberts, president of the National Academy of Sciences, introduced this issue with an article titled “The Cell as a Collection of Protein Machines.” In it he remarked, We have always underestimated cells.... The entire cell can be viewed as a factory that contains an elaborate network of interlocking assembly lines, each of which is composed of a set of large protein machines.... Why do we call the large protein assemblies that underlie cell function protein machines? Precisely because, like machines invented by humans to deal efficiently with the macroscopic world, these protein assemblies contain highly coordinated moving parts. 2 • IRREDUCIBLE COMPLEXITY REVISITED Almost six years later (December 2003), BioEssays published its own special issue on “molecular machines.” In the introductory essay to that issue, Adam Wilkins, the editor of BioEssays, remarked, The articles included in this issue demonstrate some striking parallels between artifactual and biological/molecular machines. In the first place, molecular machines, like man-made machines, perform highly specific functions. Second, the macromolecular machine complexes feature multiple parts that interact in distinct and precise ways, with defined inputs and outputs. Third, many of these machines have parts that can be used in other molecular machines (at least, with slight modification), comparable to the interchangeable parts of artificial machines. Finally, and not least, they have the cardinal attribute of machines: they all convert energy into some form of ‘work’. Alberts and Wilkins here draw attention to the strong resemblance between molecular machines and machines designed by human engineers. Nevertheless, as neo-Darwinists, they regard the cell’s marvelous complexity as products of Darwinian evolution and thus as only apparently designed. In the 1990s, however, scientists began to challenge the neo-Darwinian view and argue that such protein machines could only have arisen by means of actual design. For example, in 1996 Lehigh University biochemist Michael Behe published a book titled Darwin’s Black Box. In that book he detailed the failure of neo-Darwinian theory to explain the origin of complex molecular machines in the cell. But he didn’t stop there. He also argued that these molecular machines exhibit actual design. Central to his argument was the idea of irreducible complexity. A functional system is irreducibly complex if it contains a multipart subsystem (i.e., a set of two or more interrelated parts) that cannot be simplified without destroying the system’s basic function. I refer to this multipart subsystem as the system’s irreducible core. This definition is more subtle than it might first appear, so let’s consider it closely. Irreducibly complex systems belong to the broader class of functionally integrated systems. A functionally integrated system consists of parts that are tightly adapted to each other and thus render the system’s function highly sensitive to isolated changes of those parts. For an integrated system, a change in one place often shuts down the system entirely or else requires multiple changes elsewhere for the system to continue to function. We can therefore define the core of a functionally integrated system as those parts that are indispensable to the system’s basic function: WILLIAM A. DEMBSKI • 3 remove parts of the core, and you can’t recover the system’s basic function from the other remaining parts. To say that a core is irreducible is then to say that no other systems with substantially simpler cores can perform the system’s basic function.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solomon's Descent Algebra Revisited

Starting from a non-standard definition, the descent algebra of the symmetric group is investigated. Homomorphisms into the tensor product of smaller descent algebras are defined. They are used to construct the irreducible representations and to obtain the nilpotency index of the radical.

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

Iranian EFL Learners’ Motivation Construction: Integrative Motivation Revisited

Although Gardner and his associates’ work was most influential in the field of L2 motivation, from the early 1990s onwards, their work has been criticized for several reasons. Some researchers claimed that integrative and instrumental orientations were no longer able to convey the complexity of the L2 motivation construct. To examine this complexity, the present study attempted to investigate t...

متن کامل

A Reconciliation with Non-binary Gene Trees Revisited

By reconciling the phylogenetic tree of a gene family with the corresponding species tree, it is possible to infer lineage-specific duplications and losses with high confidence and hence to annotate orthologs and paralogs. The currently available reconciliation methods for non-binary gene trees are computationally expensive for genome-scale applications. We present four O(|G| + |S|) algorithms ...

متن کامل

SU(3) revisited

The “D” matrices for all states of the two fundamental representations and octet are shown in the generalized Euler angle parameterization. The raising and lowering operators are given in terms of linear combinations of the left invariant vector fields of the group manifold in this parameterization. Using these differential operators the highest weight state of an arbitrary irreducible represen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004